Covering algebras and q-binomial generating functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering algebras and q-binomial generating functions

The. theory of reduced incidence algebras of binomial posets furnishes a unified treatment of several types of generating functions that arise in enumerative combinatorics. Using this theory as a tool, we study ‘reduced covering algebras’ of binomial lattices and show that they are isomorphic to various algebras of q-binomial generating functions for certain modular binomial lattices.

متن کامل

Sieved Partition Functions and Q-binomial Coefficients

Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved q-binomial coefficient is the sum of those terms whose exponents are congruent to r modulo t. In this paper explicit polynomial identities in q are given for sieved q-binomial coefficients. As a limiting case, generating functions for the sieved partition function are found as ...

متن کامل

The q-Log-convexity of the Generating Functions of the Squares of Binomial Coefficients

We prove a conjecture of Liu and Wang on the q-log-convexity of the polynomial sequence { ∑n k=0 ( n k )2 q}n≥0. By using Pieri’s rule and the Jacobi-Trudi identity for Schur functions, we obtain an expansion of a sum of products of elementary symmetric functions in terms of Schur functions with nonnegative coefficients. Then the principal specialization leads to the q-log-convexity. We also pr...

متن کامل

Short Generating Functions for some Semigroup Algebras

Let a1, a2, . . . , an be distinct, positive integers with (a1, a2, . . . , an) = 1, and let k be an arbitrary field. Let H(a1, . . . , an; z) denote the Hilbert series of the graded algebra k[ta1 , ta2 , . . . , tan ]. We show that, when n = 3, this rational function has a simple expression in terms of a1, a2, a3; in particular, the numerator has at most six terms. By way of contrast, it is kn...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1994

ISSN: 0012-365X

DOI: 10.1016/0012-365x(94)90106-6